A comparison of two popular end-to-end congestion control algorithms: the case of AIMD and AIPD

نویسندگان

  • Kang-Won Lee
  • Tae-eun Kim
  • Vaduvur Bharghavan
چکیده

The focus of this paper is to compare two popular end-to-end congestion control algorithms in the literature, namely, AIMD (additive increase/multiplicative decrease) and AIPD (additive increase/loss proportional decrease). We clarify the definitions of AIMD and AIPD algorithms, and compare them in various aspects such as convergence, steady state throughput, fairness characteristics, and the corresponding utility functions. The comparison is based on a simple mathematical analysis and a set of simulation results using the ns-2 simulator. Keywords—Congestion control, Fairness, Utility Function, Additive Increase/Multiplicative Decrease (AIMD), Additive Increase/Loss Proportional Decrease (AIPD), TCP-friendliness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparison of End-to-End Congestion Control Algorithms: The Case of AIMD and AIPD

The focus of this paper is to compare two popular congestion control algorithms: AIMD (additive increase/multiplicative decrease) and AIPD (additive increase/loss proportional decrease). The key contributions of the paper are two-fold: (a) we first clarify the definitions of AIMD and AIPD congestion control algorithms, and compare them in various aspects: convergence characteristics, steady sta...

متن کامل

Additive increase adaptive decrease congestion control: a mathematical model and its experimental validation

Due to the fundamental end-to-end design principle of the TCP/IP for which the network cannot supply any explicit feedback, today TCP congestion control algorithm implements an additive increase multiplicative decrease (AIMD) algorithm. It is widely recognized that the AIMD mechanism is at the core of the stability of end-to-end congestion control. In this paper we describe a new mechanism we c...

متن کامل

Scalable service differentiation using purely end-to-end mechanisms: features and limitations

We investigate schemes for achieving service differentiation via weighted end-to-end congestion control mechanisms within the framework of the additive increase/multiplicative decrease (AIMD) principle, and study their performance as instantiations of the TCP protocol. Our first approach considers a class of weighted AIMD algorithms. This approach does not scale well in practice because it lead...

متن کامل

شیوه های توزیع بار در مهندسی ترافیک

Because of rapidly rising network traffic, ISP providers are trying to create new network structures and extend more resources to control the growth of demands. It is important to efficiently split the network bandwidth among different sources so that each user has enough bandwidth.  Traffic engineering is used to achieve this goal.   Performing reliable and efficient network ope...

متن کامل

COST OPTIMIZATION OF END-FILLED CASTELLATED BEAMS USING META-HEURISTIC ALGORITHMS

The main object of this research is to optimize an end-filled castellated beam. In order to support high shear forces close to the connections, sometimes it becomes necessary to fill certain holes in web opening beam. This is done by inserting steel plates and welding from both sides. Optimization of these beams is carried out using three meta-heuristic methods involves CSS, CBO, and CBO-PSO al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001